A Method of Solving Multi-Product. Multi-Stage Lot Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Solving Scheduling Problems in a Multi-stage Multi- product Batch Pharmaceutical Industry
An iterative two-stage decomposition solution strategy for solving real-world scheduling problems in multi-stage multi-product batch plants is presented. The proposed method has as a core a mixed integer mathematical model, and consists of a constructive step, wherein a feasible and good solution is rapidly generated by following some insertion criteria, and an improvement step, wherein the ini...
متن کاملCombination of Genetic Algorithm With Lagrange Multipliers For Lot-Size Determination in Capacity Constrained Multi-Period, Multi-Product and Multi-Stage Problems
Abstract : In this paper a meta-heuristic approach has been presented to solve lot-size determination problems in a complex multi-stage production planning problems with production capacity constraint. This type of problems has multiple products with sequential production processes which are manufactured in different periods to meet customer’s demand. By determining the decision variables, mac...
متن کاملTerminal Constraints for Single-stage Multi-product Scheduling Problems
In scheduling, it is important to maintain the terminal inventory levels above threshold values to prevent stockout. However, simply enforcing the terminal inventory level above a lead-time-based threshold for each product, as it is common practice, does not exploit the relationships of inventory levels among products. To overcome this drawback, we propose a new type of terminal constraints for...
متن کاملSolving Multi-level, Multi-product and Multi-period Lot Sizing and Scheduling Problem in Permutation Flow Shop
In this paper, a new model of capacitated lot sizing and scheduling in a permutation flow shop is developed. In this model demand can be totally backlogged. Setups can be carryover and are sequence-dependent. It is well-known from literatures that capacitated lot sizing problem in permutation flow shop systems are NP-hard. This means the model is solved in polynomial time and metaheuristics alg...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
سال: 1981
ISSN: 0387-5024,1884-8354
DOI: 10.1299/kikaic.47.1401